首页> 外文OA文献 >A meta-heuristic algorithm for solving the road network design problem in regional contexts
【2h】

A meta-heuristic algorithm for solving the road network design problem in regional contexts

机译:一种求解区域环境下道路网络设计问题的元启发式算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper we focus on the road network design problem in regional contexts. In this case a planner may have financial resources to invest for improving performance on existing roads. Against the background of an extensive literature of optimisation models and algorithms to solve this problem, the innovative aspects of this paper are as follows: the optimisation model refers to the daily operation of the network; the objective function also considers the environmental costs; the proposed meta-heuristic solution algorithm has never been used to solve this problem; and the assignment algorithm is based on Ant Colony Optimisation in order to reduce computing times. The model and algorithm were tested on a real-scale problem, showing their applicability to real dimension networks.
机译:在本文中,我们重点研究区域环境下的道路网络设计问题。在这种情况下,规划人员可能有财力进行投资,以改善现有道路的性能。在解决这一问题的大量优化模型和算法的文献背景下,本文的创新之处如下:优化模型指的是网络的日常运行;目标函数还考虑了环境成本;提出的元启发式求解算法从未用于解决该问题。分配算法基于蚁群优化,以减少计算时间。该模型和算法在实际问题上进行了测试,显示了它们对实际维度网络的适用性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号